Classes of Matroids
نویسنده
چکیده
This paper explores which classes of graphs and matroids are k-balanced. A connection between k-balanced graphs and k-balanced matroids was also obtained. In this paper, we continue our study of the class of k-balanced matroids in order to see what matroid operations preserve k-balance. Since strong maps of matroids are defined as analogues of continuous maps of topological spaces, it is natural to ask what other topological notions carry over to matroids. In characterizing strong maps from 2000 to 2003, Al-Hawary defined a closure matroid to be a matroid in which A ∪ B = A∪B for all subsets A and B of its ground set. We obtain a new classification of closure matroids. Moreover, necessary and sufficient conditions for the direct sum, parallel extension connection and series extension connection to preserve k-balance property are given.
منابع مشابه
An Obstacle to a Decomposition Theorem for Near-Regular Matroids
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obta...
متن کاملM ay 2 00 9 An obstacle to a decomposition theorem for near - regular matroids ∗
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obta...
متن کاملForbidden Subsystem Characterization of Matroids and Applications to Classes of Matroid Generating Graphs Forbidden Subsystem Characterization of Matroids and Applications to Classes of Matroid Generating Graphs
We provide a forbidden induced subsystem characterization of those independence systems which are matroids. On this basis we describe a method for characterizing classes of matroid-deening graphs, associated to every hereditary graph property.
متن کاملThe relations between matroids of arbitrary cardinality and independence spaces
This paper deals with the relationships between two classes of infinite matroids–the classes of matroids of arbitrary cardinality and of independence spaces primarily with the help of hyperplane set approach and sometimes of closure operator approach.
متن کاملComplexity of Testing Reachability in Matroids
We extend the complexity theoretic framework of reachability problems in graphs to the case of matroids. Given a matroid M and two elements s and t of the ground set, the reachability problem is to test if there is a circuit in M containing both s and t. We show complexity characterizations for several important classes of matroids. In particular, we show: (1) For two important classes of matro...
متن کاملQuasi-graphic matroids
Frame matroids and lifted-graphic matroids are two interesting generalizations of graphic matroids. Here we introduce a new generalization, quasi-graphic matroids, that unifies these two existing classes. Unlike frame matroids and lifted-graphic matroids, it is easy to certify that a matroid is quasi-graphic. The main result of the paper is that every 3-connected representable quasi-graphic mat...
متن کامل